In Israel, whistleblowing in the nursing profession has been largely ignored. This topic is neither part of the professional—ethical discourse nor a subject for research. Focusing on the divide between internal and external whistleblowing, this article presents a study that explores nurses’ willingness to disclose an act that could jeopardize the rights or safety of patients. Internal disclosure entails reporting wrongdoing to an authority within the organization. External disclosure involves reporting the offense to an outside agency, such as a professional (...) organization or the press. The study’s findings indicate that the nurse respondents viewed both the harmful misconduct of a colleague and that of a manager as being very serious. In such dilemmas the nurses reported a desire to correct the wrongdoing and a concomitant willingness to act. They were, however, much more likely to whistleblow internally rather than externally. This study revealed a pattern of nurses’ progressive retraction as the circle of disclosure widened. (shrink)

This article presents a study on the ethical dilemma of whistleblowing in physical therapy, and suggests some lines for further research on this topic as well as ways for integrating it in the physical therapy curriculum. The study examines the self-reported willingness of physical therapy students to report misconduct, whether internally or externally, to protect the patient's interests. Internal disclosure entails reporting the wrongdoing to an authority within the organisation. External disclosure entails reporting the offence to an outside agency, such (...) as the police, professional organisation, or press. The findings indicate that the students view the acts that are detrimental or cause injustice to the patient in a very serious light. In dilemma situations such as these, the students reported a willingness to act. The students also report considerably greater likelihood of whistleblowing internally than externally. The pattern reveals a desire to correct the misconduct coupled with a marked decline in the willingness to blow the whistle as this act moved from the workplace to an external authority. (shrink)

We study in detail the blow-up procedure described in [BTW01]. We obtain a structure theorem for coreless polygroups as a double quotient space G//H, and a polygroup chunk theorem. Seeking to remove the arbitrary parameter needed for the blow-up, we find canonical Ø-invariant groupoids.

Given a continuous and isometric action of a Polish group G on an adequate Polish topometric space $(X,\tau,\rho )$ and $x \in X$, we find a necessary and sufficient condition for $\overline {Gx}^{\rho }$ to be co-meagre; we also obtain a criterion that characterizes when such a point exists. This work completes a criterion established in earlier work of the authors.

For a locally compact group G, we show that it is possible to present the class of continuous unitary representations of G as an elementary class of metric structures, in the sense of continuous logic. More precisely, we show how nondegenerate ∗-representations of a general ∗-algebra A (with some mild assumptions) can be viewed as an elementary class, in a many-sorted language, and use the correspondence between continuous unitary representations of G and nondegenerate ∗-representations of L1(G). We relate the notion (...) of ultraproduct of logical structures, under this presentation, with other notions of ultraproduct of representations appearing in the literature, and we characterize property (T) for G in terms of the definability of the sets of fixed points of L1 functions on G. (shrink)

In recent years, scientists have increasingly taken to investigate the predictive nature of cognition. We argue that prediction relies on abstraction, and thus theories of predictive cognition need an explicit theory of abstract representation. We propose such a theory of the abstract representational capacities that allow humans to transcend the “here-and-now.” Consistent with the predictive cognition literature, we suggest that the representational substrates of the mind are built as ahierarchy, ranging from the concrete to the abstract; however, we argue that (...) there are qualitative differences between elements along this hierarchy, generating meaningful, often unacknowledged,diversity.Echoing views from philosophy, we suggest that the representational hierarchy can be parsed into:modality-specificrepresentations, instantiated on perceptual similarity;multimodalrepresentations, instantiated primarily on the discovery of spatiotemporal contiguity; andcategoricalrepresentations, instantiated primarily on social interaction. These elements serve as the building blocks ofcomplex structures discussed in cognitive psychology (e.g., episodes, scripts) and are the inputs for mental representations that behave like functions, typically discussed in linguistics (i.e.,predicators). We support our argument for representational diversity by explaining how the elements in our ontology are all required to account for humans’ predictive cognition (e.g., in subserving logic-based prediction; in optimizing the trade-off between accurate and detailed predictions) and by examining how the neuroscientific evidence coheres with our account. In doing so, we provide a testable model of the neural bases of conceptual cognition and highlight several important implications to research on self-projection, reinforcement learning, and predictive-processing models of psychopathology. (shrink)

Introduction Adolescents’ physical activity (PA) behavior can be driven by several psychosocial determinants at the same time. Most analyses use a variable-based approach that examines relations between PA-related determinants and PA behavior on the between-person level. Using this approach, possible coexistences of different psychosocial determinants within one person cannot be examined. Therefore, by applying a person-oriented approach, this study examined a) which profiles regarding PA-related psychosocial variables typically occur in female sixth-graders, b) if these profiles deliver a self-consistent picture according (...) to theoretical assumptions, and c) if the profiles contribute to the explanation of PA. Materials and Methods The sample comprised 475 female sixth-graders. Seventeen PA-related variables were assessed: support for autonomy, competence and relatedness in PE as well as their satisfaction in PE and leisure-time; behavioral regulation of exercise (five subscales); self-efficacy and social support from friends and family (two subscales). Moderate-to-vigorous PA was measured using accelerometers. Data were analyzed using the self-organizing maps (SOM) analysis, a cluster analysis including an unsupervised algorithm for non-linear models. Results According to the respective level of psychosocial resources, a positive, a medium and a negative cluster were identified. This superordinate cluster solution represented a self-consistent picture that was in line with theoretical assumptions. The three-cluster solution contributed to the explanation of PA behavior, with the positive cluster accumulating an average of six minutes more moderate-to-vigorous PA per day than the medium cluster and ten minutes more than the negative cluster. Additionally, SOM detected a subgroup within the positive cluster that benefited from a specific combination of intrinsic and external regulations with regard to PA. Discussion The results underline the relevance of the assessed psychosocial determinants of PA behavior in female sixth-graders. The results further indicate that the different psychosocial resources within a given person do not develop independently of one another, which supports the use of a person-oriented approach. In addition, the SOM analysis identified subgroups with specific characteristics, which would have remained undetected using variable-based approaches. Thus, this approach offers the possibility to reduce data complexity without overlooking subgroups with special demands that go beyond the superordinate cluster solution. (shrink)

"Cover"--"Title Page"--"Copyright" -- "Contents" -- "Introduction: At the Scene of Inscription" -- "1. Savage Marks: Subjection and the Specters of Anthropology" -- "2. Impact Erasure: Psychoanalysis and the Multiplication of Trauma" -- "3. Stings of Visibility: Picture Theories and Visual Contact" -- "4. Out of the Groove: Aural Traces and the Mediation of Sound" -- "Conclusion: Against Inscription?" -- "Acknowledgments" -- "Notes" -- "Works Cited.

We develop positive model theory, which is a non first order analogue of classical model theory where compactness is kept at the expense of negation. The analogue of a first order theory in this framework is a compact abstract theory: several equivalent yet conceptually different presentations of this notion are given. We prove in particular that Banach and Hilbert spaces are compact abstract theories, and in fact very well-behaved as such.

We continue [2], developing simplicity in the framework of compact abstract theories. Due to the generality of the context we need to introduce definitions which differ somewhat from the ones use in first order theories. With these modified tools we obtain more or less classical behaviour: simplicity is characterized by the existence of a certain notion of independence, stability is characterized by simplicity and bounded multiplicity, and hyperimaginary canonical bases exist.

We introduce the notion of a lovely pair of models of a simple theory T, generalizing Poizat's “belles paires” of models of a stable theory and the third author's “generic pairs” of models of an SU-rank 1 theory. We characterize when a saturated model of the theory TP of lovely pairs is a lovely pair , finding an analog of the nonfinite cover property for simple theories. We show that, under these hypotheses, TP is also simple, and we study forking (...) and canonical bases in TP. We also prove that assuming only that T is low, the existentially universal models of the universal part of a natural expansion TP+ of TP, are lovely pairs, and “simple Robinson universal domains”. (shrink)

We develop the general theory of topometric spaces, i.e., topological spaces equipped with a well-behaved lower semi-continuous metric. Spaces of global and local types in continuous logic are the motivating examples for the study of such spaces. In particular, we develop Cantor-Bendixson analysis of topometric spaces, which can serve as a basis for the study of local stability (extending the ad hoc development in Ben Yaacov I and Usvyatsov A, Continuous first order logic and local stability. Trans Am Math (...) Soc, in press), as well as of global ${\aleph_0}$ -stability. We conclude with a study of perturbation systems (see Ben Yaacov I, On perturbations of continuous structures, submitted) in the formalism of topometric spaces. In particular, we show how the abstract development applies to ${\aleph_0}$ -stability up to perturbation. (shrink)

We give a general framework for the treatment of perturbations of types and structures in continuous logic, allowing to specify which parts of the logic may be perturbed. We prove that separable, elementarily equivalent structures which are approximately $aleph_0$-saturated up to arbitrarily small perturbations are isomorphic up to arbitrarily small perturbations. As a corollary, we obtain a Ryll-Nardzewski style characterisation of complete theories all of whose separable models are isomorphic up to arbitrarily small perturbations.

We revisit the foundations of positive model theory, introducing h-inductive sentences. These allow a considerably simplified presentation of positive model theory, as well as a characterisation of Hausdorff cats by an amalgamation property of their h-inductive theory.

We prove that under reasonable assumptions, every cat (compact abstract theory) is metric, and develop some of the theory of metric cats. We generalise Morley's theorem: if a countable Hausdorff cat T has a unique complete model of density character Λ ≥ ω₁, then it has a unique complete model of density character Λ for every Λ ≥ ω₁.

We present a framework for model theoretic forcing in a non first order context, and present some applications of this framework to Banach space theory.

-/- Continuous first-order logic has found interest among model theorists who wish to extend the classical analysis of “algebraic” structures (such as fields, group, and graphs) to various natural classes of complete metric structures (such as probability algebras, Hilbert spaces, and Banach spaces). With research in continuous first-order logic preoccupied with studying the model theory of this framework, we find a natural question calls for attention. Is there an interesting set of axioms yielding a completeness result? -/- The primary purpose (...) of this article is to show that a certain, interesting set of axioms does indeed yield a completeness result for continuous first-order logic. In particular, we show that in continuous first-order logic a set of formulae is (completely) satisfiable if (and only if) it is consistent. From this result it follows that continuous first-order logic also satisfies an approximated form of strong completeness, whereby Σ⊧φ (if and) only if Σ⊢φ ∸2−n for all n < ω. This approximated form of strong completeness asserts that if Σ⊧φ, then proofs from Σ, being finite, can provide arbitrarily better approximations of the truth of φ. -/- Additionally, we consider a different kind of question traditionally arising in model theory—that of decidability. When is the set of all consequences of a theory (in a countable, recursive language) recursive? Say that a complete theory T is decidable if for every sentence φ, the value φ T is a recursive real, and moreover, uniformly computable from φ. If T is incomplete, we say it is decidable if for every sentence φ the real number φ T o is uniformly recursive from φ, where φ T o is the maximal value of φ consistent with T. As in classical first-order logic, it follows from the completeness theorem of continuous first-order logic that if a complete theory admits a recursive (or even recursively enumerable) axiomatization then it is decidable. (shrink)

We present an adaptation of continuous first order logic to unbounded metric structures. This has the advantage of being closer in spirit to C. Ward Henson's logic for Banach space structures than the unit ball approach, as well as of applying in situations where the unit ball approach does not apply. We also introduce the process of single point emph{emboundment}, allowing to bring unbounded structures back into the setting of bounded continuous first order logic. Together with results from cite{BenYaacov:Perturbations} regarding (...) perturbations of bounded metric structures, we prove a Ryll-Nardzewski style characterisation of theories of Banach spaces which are separably categorical up to small perturbation of the norm. This last result is motivated by an unpublished result of Henson. (shrink)

We point out how the "Fundamental Theorem of Stability Theory", namely the equivalence between the "non order property" and definability of types, proved by Shelah in the 1970s, is in fact an immediate consequence of Grothendieck's "Criteres de compacite" from 1952. The familiar forms for the defining formulae then follow using Mazur's Lemma regarding weak convergence in Banach spaces.

We prove that in a continuous ℵ₀-stable theory every type-definable group is definable. The two main ingredients in the proof are: 1. Results concerning Morley ranks (i.e., Cantor-Bendixson ranks) from [Ben08], allowing us to prove the theorem in case the metric is invariant under the group action; and 2. Results concerning the existence of translation-invariant definable metrics on type-definable groups and the extension of partial definable metrics to total ones.

Accumulating data suggest that the eukaryotic cell originated from a merger of two prokaryotes, an archaeal host and a bacterial endosymbiont. However, since prokaryotes are unable to perform phagocytosis, the means by which the endosymbiont entered its host is an enigma. We suggest that a predatory or parasitic interaction between prokaryotes provides a reasonable explanation for this conundrum. According to the model presented here, the host in this interaction was an anaerobic archaeon with a periplasm‐like space. The predator was a (...) small (facultative) aerobic α‐proteobacterium, which penetrated and replicated within the host periplasm, and later became the mitochondria. Plausible conditions under which this interaction took place and circumstances that may have led to the contemporary complex eukaryotic cell are discussed. (shrink)

This paper completes the proof of the group configuration theorem for simple theories started in [1]. We introduce the notion of an almost hyperdefinable structure, and show that it has a reasonable model theory. We then construct an almost hyperdefinable group from a polygroup chunk.

We prove that for every simple theory $T$ (or even simple thick compact abstract theory) there is a (unique) compact abstract theory $T^fP$ whose saturated models are the lovely pairs of $T$. Independence-theoretic results that were proved in [Ben Yaacov, Pillay, Vassiliev - Lovely pairs of models] when $T^fP$ is a first order theory are proved for the general case: in particular $T^fP$ is simple and we characterise independence.

We prove that the definition of supersimplicity in metric structures from [Ben Yaacov, Uncountable dense categoricity in cats] is equivalent to an textit{a priori} stronger variant. This stronger variant is then used to prove that if $T$ is a supersimple Hausdorff cat then so is its theory of lovely pairs.

We develop several aspects of local and global stability in continuous first order logic. In particular, we study type-definable groups and genericity.

In recent work, the authors have established the group configuration theorem for simple theories, as well as some of its main applications from geometric stability theory, such as the binding group theorem, or in the $\omega$-categorical case, the characterization of the forking geometry of a finitely based non-trivial locally modular regular type as projective geometry over a finite field and the equivalence of pseudolinearity and local modularity. The proof necessitated an extension of the model-theoretic framework to include almost hyperimaginaries, and (...) the study of polygroups. (shrink)

This is a comprehensive study of the dynamics that underlie information processing in foreign policy decision-making, the resultant biases and errors, and the implications for the quality of decisions. The World in Their Minds is a compendium of the manifold ways that misperception and, hence, miscalculation can enter into seemingly rational policy choice. The cases of Vietnam for the Americans and the Yom Kippur War for the Israelis constitute the primary database for the number of illustrations cited.

This communication deals with positive model theory, a non first order model theoretic setting which preserves compactness at the cost of giving up negation. Positive model theory deals transparently with hyperimaginaries, and accommodates various analytic structures which defy direct first order treatment. We describe the development of simplicity theory in this setting, and an application to the lovely pairs of models of simple theories without the weak non finite cover property.

We develop the theory of germs of generic functions in simple theories. Starting with an algebraic quadrangle (or other similar hypotheses), we obtain an "almost" generic group chunk, where the product is denned up to a bounded number of possible values. This is the first step towards the proof of the group configuration theorem for simple theories, which is completed in [3].

We characterise imaginaries (up to interdefinability) in Hilbert spaces using a Galois theory for compact unitary groups.

Dividing independence for ultraimaginaries is neither symmetric nor transitive. Moreover, any notion of independence satisfying certain axioms (weaker than those for independence in a simple theory) and defined for all ultraimaginary sorts, is necessarily trivial.

1. We show that if p is a real type which is internal in a set $\sigma$ of partial types in a simple theory, then there is a type p' interbounded with p, which is finitely generated over $\sigma$ , and possesses a fundamental system of solutions relative to $\sigma$ . 2. If p is a possibly hyperimaginary Lascar strong type, almost \sigma-internal$ , but almost orthogonal to $\sigma^{\omega}$ , then there is a canonical non-trivial almost hyperdefinable polygroup which multi-acts (...) on p while fixing $\sigma$ generically. In case p is $\sigma-internal$ and T is stable, this is the binding group of p over \sigma$. (shrink)

We give a model-theoretic account for several results regarding sequences of random variables appearing in Berkes and Rosenthal [12]. In order to do this,•We study and compare three notions of convergence of types in a stable theory: logic convergence, i.e., formula by formula, metric convergence (both already well studied) and convergence of canonical bases. In particular, we characterise א0-categorical stable theories in which the last two agree.•We characterise sequences that admit almost indiscernible sub-sequences.•We apply these tools to the theory of (...) atomless random variables (ARV). We characterise types and notions of convergence of types as conditional distributions and weak/strong convergence thereof, and obtain, among other things, the Main Theorem of Berkes and Rosenthal. (shrink)